2-Layer Fan-Planarity: From Caterpillar to Stegosaurus
نویسندگان
چکیده
In a fan-planar drawing of a graph there is no edge that crosses two other independent edges. We study 2-layer fan-planar drawings, i.e., fan-planar drawings such that the vertices are assigned to two distinct horizontal layers and edges are straight-line segments that connect vertices of different layers. We characterize 2-layer fan-planar drawable graphs and describe a linear-time testing and embedding algorithm for biconnected graphs. We also study the relationship between 2-layer fan-planar graphs and 2-layer right-angle crossing graphs.
منابع مشابه
Algorithms and Characterizations for 2-Layer Fan-planarity: From Caterpillar to Stegosaurus
In a fan-planar drawing of a graph there is no edge that crosses two other independent edges. We study 2-layer fan-planar drawings, i.e., fanplanar drawings such that the vertices are restricted to two distinct horizontal layers and edges are straight-line segments that connect vertices of different layers. We characterize 2-layer fan-planar drawable graphs and describe a linear-time testing an...
متن کامل1-Fan-bundle-planar drawings of graphs
Edge bundling is an important concept heavily used for graph visualization purposes. To enable the comparison with other established near-planarity models in graph drawing, we formulate a new edge-bundling model which is inspired by the recently introduced fan-planar graphs. In particular, we restrict the bundling to the endsegments of the edges. Similarly to 1-planarity, we call our model 1-fa...
متن کاملProperties and Complexity of Fan-Planarity
In a fan-planar drawing of a graph an edge can cross only edges with a common end-vertex. Fan-planar drawings have been recently introduced by Kaufmann and Ueckerdt, who proved that every n-vertex fan-planar drawing has at most 5n − 10 edges, and that this bound is tight for n ≥ 20. We extend their result, both from the combinatorial and the algorithmic point of view. We prove tight bounds on t...
متن کاملThe Postcranial Skeleton of an Exceptionally Complete Individual of the Plated Dinosaur Stegosaurus stenops (Dinosauria: Thyreophora) from the Upper Jurassic Morrison Formation of Wyoming, U.S.A.
Although Stegosaurus is one of the most iconic dinosaurs, well-preserved fossils are rare and as a consequence there is still much that remains unknown about the taxon. A new, exceptionally complete individual affords the opportunity to describe the anatomy of Stegosaurus in detail for the first time in over a century, and enables additional comparisons with other stegosaurian dinosaurs. The ne...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کامل